Which data structure allows deleting data elements from front and inserting at rear?

The Queue data structure allows deleting data elements from the front and inserting at the rear. It follows the First-In-First-Out (FIFO) principle, meaning the first element inserted is the first one to be removed.

The Queue Operations are:

• Enqueue: The operation for inserting an element at the rear of the queue.
• Dequeue: The operation for removing an element from the front of the queue.

A queue is often compared to a real-world line or queue, where the person at the front leaves first, and new people join at the rear.

Example: A real-life example of a queue is a line of people waiting for service at a bank or a supermarket checkout where the customer at the front of the line is served and leaves first, making room for the next person. And when new customers arrive, they go to the end of the line.